肺部疾病会导致严重的呼吸问题，如果未及时治疗，导致猝死。许多研究人员利用深度学习系统使用胸部X射线（CXRS）诊断肺疾病。然而，这种系统需要在大规模数据上进行详尽的培训，以有效地诊断胸部异常。此外，采购这种大规模数据通常是不可行的和不切实际的，特别是对于罕见疾病。随着较近的增量学习的进步，研究人员定期调整了深度神经网络，以了解不同的训练示例。虽然，这种系统可以抵抗灾难性的遗忘，但它们彼此独立地对待知识表示，并且这限制了它们的分类性能。此外，据我们所知，没有增量学习驱动的图像诊断框架，专门用于筛选来自CXR的肺部障碍。为了解决这个问题，我们提出了一种新颖的框架，可以学会逐步逐步筛选不同的胸部异常。除此之外，拟议的框架通过增量学习损失函数，即在逐步学习的知识表示之间识别逐步学习知识表示之间的结构和语义互相依赖性，无论扫描仪规格如何，都会识别逐步学习的知识表示之间的结构和语义相互作用。我们在包含不同胸部异常的五个公共CXR数据集上测试了拟议的框架，其中它通过各种指标表现出各种最先进的系统。

筛选行李X射线扫描的筛选杂乱和闭塞违禁品，即使对于专家的安全人员而言，甚至是一个繁琐的任务。本文提出了一种新的策略，其扩展了传统的编码器 - 解码器架构，以执行实例感知分段，并在不使用任何附加子网络或对象检测器的情况下执行违反互斥项的合并实例。编码器 - 解码器网络首先执行传统的语义分割，并检索杂乱的行李物品。然后，该模型在训练期间逐步发展，以识别各个情况，使用显着减少的训练批次。为了避免灾难性的遗忘，一种新颖的客观函数通过保留先前获得的知识来最小化每次迭代中的网络损失，同时通过贝叶斯推断解决其复杂的结构依赖性。对我们两个公开的X射线数据集的框架进行了全面评估，表明它优于最先进的方法，特别是在挑战的杂乱场景中，同时在检测准确性和效率之间实现最佳的权衡。

检测行李中的非法和威胁物品是最大的安全问题之一。即使对于经验丰富的安全人员来说，手动检测也是一种耗时和压力的任务。许多学者都创建了自动框架，用于检测行李X射线扫描的可疑和违禁品数据。然而，为了我们的知识，不存在利用时间行李X射线图像的框架，以有效地筛选高度隐藏和闭塞物体，即使赤裸的眼睛也几乎看不到。为了解决这个问题，我们提出了一种新型的时间融合驱动的多尺度残余方式编码器 - 解码器，将一系列连续扫描作为输入，并融合它们以产生可疑和不可疑行李内容的不同特征表示，导致更准确提取违禁品数据。使用可公开访问的GDXRAY数据集已彻底测试所提出的方法，该数据集是包含时间链接的灰度X射线扫描的唯一数据集，其展示了极其隐藏的违禁品数据。拟议的框架在各种度量标准上的GDXRay数据集上占据了竞争对手。

视网膜疗法代表一组视网膜疾病，如果不及时治疗，可能会导致严重的视觉障碍甚至失明。许多研究人员已经开发了自治系统，通过眼底和光学相干断层扫描（OCT）图像识别视网膜病变。然而，大多数这些框架采用传统的转移学习和微调方法，需要一种非常良好的注释训练数据来产生准确的诊断性能。本文提出了一种新型增量跨域适应仪，可以通过几次拍摄培训允许任何深度分类模型逐步学习OCT和眼底图像的异常视网膜病理。此外，与其竞争对手不同，所提出的仪器通过贝叶斯多目标函数驱动，不仅执行候选分类网络，不仅在增量培训期间保留其先前学到的知识，而且还确保网络了解先前学习的结构和语义关系病理学和新增的疾病类别在推理阶段有效地识别它们。所提出的框架，在用三种不同的扫描仪获得的六个公共数据集中评估，以筛选十三个视网膜病理，优于最先进的竞争对手，通过分别实现了0.9826和0.9846的整体准确性和F1得分。

Bipedal robots have received much attention because of the variety of motion maneuvers that they can produce, and the many applications they have in various areas including rehabilitation. One of these motion maneuvers is walking. In this study, we presented a framework for the trajectory optimization of a 5-link (planar) Biped Robot using hybrid optimization. The walking is modeled with two phases of single-stance (support) phase and the collision phase. The dynamic equations of the robot in each phase are extracted by the Lagrange method. It is assumed that the robot heel strike to the ground is full plastic. The gait is optimized with a method called hybrid optimization. The objective function of this problem is considered to be the integral of torque-squared along the trajectory, and also various constraints such as zero dynamics are satisfied without any approximation. Furthermore, in a new framework, there is presented a constraint called impact invariance, which ensures the periodicity of the time-varying trajectories. On the other hand, other constraints provide better and more human-like movement.

The importance of humanoid robots in today's world is undeniable, one of the most important features of humanoid robots is the ability to maneuver in environments such as stairs that other robots can not easily cross. A suitable algorithm to generate the path for the bipedal robot to climb is very important. In this paper, an optimization-based method to generate an optimal stairway for under-actuated bipedal robots without an ankle actuator is presented. The generated paths are based on zero and non-zero dynamics of the problem, and according to the satisfaction of the zero dynamics constraint in the problem, tracking the path is possible, in other words, the problem can be dynamically feasible. The optimization method used in the problem is a gradient-based method that has a suitable number of function evaluations for computational processing. This method can also be utilized to go down the stairs.

Pneumonia, a respiratory infection brought on by bacteria or viruses, affects a large number of people, especially in developing and impoverished countries where high levels of pollution, unclean living conditions, and overcrowding are frequently observed, along with insufficient medical infrastructure. Pleural effusion, a condition in which fluids fill the lung and complicate breathing, is brought on by pneumonia. Early detection of pneumonia is essential for ensuring curative care and boosting survival rates. The approach most usually used to diagnose pneumonia is chest X-ray imaging. The purpose of this work is to develop a method for the automatic diagnosis of bacterial and viral pneumonia in digital x-ray pictures. This article first presents the authors' technique, and then gives a comprehensive report on recent developments in the field of reliable diagnosis of pneumonia. In this study, here tuned a state-of-the-art deep convolutional neural network to classify plant diseases based on images and tested its performance. Deep learning architecture is compared empirically. VGG19, ResNet with 152v2, Resnext101, Seresnet152, Mobilenettv2, and DenseNet with 201 layers are among the architectures tested. Experiment data consists of two groups, sick and healthy X-ray pictures. To take appropriate action against plant diseases as soon as possible, rapid disease identification models are preferred. DenseNet201 has shown no overfitting or performance degradation in our experiments, and its accuracy tends to increase as the number of epochs increases. Further, DenseNet201 achieves state-of-the-art performance with a significantly a smaller number of parameters and within a reasonable computing time. This architecture outperforms the competition in terms of testing accuracy, scoring 95%. Each architecture was trained using Keras, using Theano as the backend.

Finding and localizing the conceptual changes in two scenes in terms of the presence or removal of objects in two images belonging to the same scene at different times in special care applications is of great significance. This is mainly due to the fact that addition or removal of important objects for some environments can be harmful. As a result, there is a need to design a program that locates these differences using machine vision. The most important challenge of this problem is the change in lighting conditions and the presence of shadows in the scene. Therefore, the proposed methods must be resistant to these challenges. In this article, a method based on deep convolutional neural networks using transfer learning is introduced, which is trained with an intelligent data synthesis process. The results of this method are tested and presented on the dataset provided for this purpose. It is shown that the presented method is more efficient than other methods and can be used in a variety of real industrial environments.

An expansion of aberrant brain cells is referred to as a brain tumor. The brain's architecture is extremely intricate, with several regions controlling various nervous system processes. Any portion of the brain or skull can develop a brain tumor, including the brain's protective coating, the base of the skull, the brainstem, the sinuses, the nasal cavity, and many other places. Over the past ten years, numerous developments in the field of computer-aided brain tumor diagnosis have been made. Recently, instance segmentation has attracted a lot of interest in numerous computer vision applications. It seeks to assign various IDs to various scene objects, even if they are members of the same class. Typically, a two-stage pipeline is used to perform instance segmentation. This study shows brain cancer segmentation using YOLOv5. Yolo takes dataset as picture format and corresponding text file. You Only Look Once (YOLO) is a viral and widely used algorithm. YOLO is famous for its object recognition properties. You Only Look Once (YOLO) is a popular algorithm that has gone viral. YOLO is well known for its ability to identify objects. YOLO V2, V3, V4, and V5 are some of the YOLO latest versions that experts have published in recent years. Early brain tumor detection is one of the most important jobs that neurologists and radiologists have. However, it can be difficult and error-prone to manually identify and segment brain tumors from Magnetic Resonance Imaging (MRI) data. For making an early diagnosis of the condition, an automated brain tumor detection system is necessary. The model of the research paper has three classes. They are respectively Meningioma, Pituitary, Glioma. The results show that, our model achieves competitive accuracy, in terms of runtime usage of M2 10 core GPU.

This paper proposes a perception and path planning pipeline for autonomous racing in an unknown bounded course. The pipeline was initially created for the 2021 evGrandPrix autonomous division and was further improved for the 2022 event, both of which resulting in first place finishes. Using a simple LiDAR-based perception pipeline feeding into an occupancy grid based expansion algorithm, we determine a goal point to drive. This pipeline successfully achieved reliable and consistent laps in addition with occupancy grid algorithm to know the ways around a cone-defined track with an averaging speeds of 6.85 m/s over a distance 434.2 meters for a total lap time of 63.4 seconds.